منابع مشابه
The zig-zag product
The expander constructions based on algebraic methods can give expanders that are both explicit (i.e. we can quickly construct the graph, or even obtain neighborhood information without constructing the entire graph, and Ramanujan, meaning that the spectral gap is essentially as large as possible. It also follows from this spectral bound that the edge expansion of Ramanujan graphs is essentiall...
متن کاملSteiner Minimal Trees ∗
While a spanning tree spans all vertices of a given graph, a Steiner tree spans a given subset of vertices. In the Steiner minimal tree problem, the vertices are divided into two parts: terminals and nonterminal vertices. The terminals are the given vertices which must be included in the solution. The cost of a Steiner tree is defined as the total edge weight. A Steiner tree may contain some no...
متن کاملZig-zag Path to Understanding
OUT understanding of the fundamental physical limits of information handling has developed along a very convoluted path. Most of the initially plausible physical conjectures have turned out to be wrong. A participant’s personal view of these events is not a disciplined contribution to the history of science. I do, however, last my own mistakes along with those of others.
متن کاملSurface plasmons on zig-zag gratings.
Optical excitation of surface plasmons polaritons (SPPs) on a 'zig-zag diffraction grating' is explored. The fabricated silver grating consists of sub-wavelength grooves 'zig-zagged' along their length, providing a diffractive periodicity to visible radiation. SPPs propagating in the diffraction plane and scattered by an odd number of grating vectors are only excited by TE polarized radiation, ...
متن کاملFull Minimal Steiner Trees on Lattice Sets
Given a finite set of points P in the Euclidean plane, the Steiner problem asks us to constuct a shortest possible network interconnecting P. Such a network is known as a minimal Steiner tree. The Steiner problem is an intrinsically difficult one, having been shown to be NP-hard [7]; however, it often proves far more tractable if we restrict our attention to points in special geometric configur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1983
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1983-0697066-5